A Tight Linear Time ( 1 / 2 ) - Approximation for Unconstrained Submodular

نویسنده

  • John Miller
چکیده

Consider a manager hiring workers to staff a new factory. Moving from zero employees to a thousand employees exponentially increases the factory’s production. Recognizing a pattern, the manager again hires a thousand employees. This increase in workers also raises factory production because machines are now used more efficiently, but the effect is not quite as dramatic as opening the factory from scratch. Emboldened by his previous success, the manager decides to hire another thousand workers. However, this time the additional workers leads to overcrowding, and the factory’s production barely increases. This phenomenon, the principle of diminishing returns, is a foundational concept in economics. Intuitively, adding an additional unit of a good to a small set has a much larger impact compared to adding a single unit of a good to a larger set. This notion is rigorously captured by the theory of submodular functions, which we define as follows.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

On maximizing a monotone k-submodular function subject to a matroid constraint

A k-submodular function is an extension of a submodular function in that its input is given by k disjoint subsets instead of a single subset. For unconstrained nonnegative ksubmodular maximization, Ward and Živný proposed a constant-factor approximation algorithm, which was improved by the recent work of Iwata, Tanigawa and Yoshida presenting a 1/2-approximation algorithm. Iwata et al. also pro...

متن کامل

Submodular Function Maximization on the Bounded Integer Lattice

The problem of maximizing non-negative submodular functions has been studied extensively in the last few years. However, most papers consider submodular set functions. Recently, several advances have been made for submodular functions on the integer lattice. As a direct generalization of submodular set functions, a function f : {0, . . . , C}n → R+ is submodular, if f(x)+ f(y) ≥ f(x∧ y)+ f(x∨ y...

متن کامل

Improved Approximation Algorithms for k-Submodular Function Maximization

This paper presents a polynomial-time 1/2-approximation algorithm for maximizing nonnegative k-submodular functions. This improves upon the previous max{1/3, 1/(1+a)}-approximation by Ward and Živný [15], where a = max{1, √ (k − 1)/4}. We also show that for monotone ksubmodular functions there is a polynomial-time k/(2k− 1)-approximation algorithm while for any ε > 0 a ((k + 1)/2k + ε)-approxim...

متن کامل

Deterministic Algorithms for Submodular Maximization Problems

Randomization is a fundamental tool used in many theoretical and practical areas of computer science. We study here the role of randomization in the area of submodular function maximization. In this area most algorithms are randomized, and in almost all cases the approximation ratios obtained by current randomized algorithms are superior to the best results obtained by known deterministic algor...

متن کامل

Viral Marketing for Digital Goods in Social Networks

Influence maximization is a problem of finding a small set of highly influential individuals in social networks to maximize the spread of influence. However, the distinction between the spread of influence and profit is neglected. The problem of profit maximization in social network extends the influence maximization problems to a realistic setting aiming to gain maximum profit in social networ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2014